A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs
نویسندگان
چکیده
منابع مشابه
Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs
Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph problems. For general m-edge and n-vertex graphs, it is well-known to be solvable in O(m √ n) time. We develop the first linear-time algorithm to find maximumcardinality matchings on cocomparability graphs, a prominent subclass of perfect graphs that contains interval graphs as well as permutati...
متن کاملLinear Time LexDFS on Cocomparability Graphs
Lexicographic depth first search (LexDFS) is a graph search protocol which has already proved to be a powerful tool on cocomparability graphs, a subfamily of perfect graphs. Cocomparability graphs have been well studied through their complements (comparability graphs) and their corresponding posets. Recently however LexDFS has led to a number of elegant near linear time algorithms on cocomparab...
متن کاملGPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs
We design, implement, and evaluate GPU-based algorithms for the maximum cardinality matching problem in bipartite graphs. Such algorithms have a variety of applications in computer science, scientific computing, bioinformatics, and other areas. To the best of our knowledge, ours is the first study which focuses on GPU implementation of the maximum cardinality matching algorithms. We compare the...
متن کاملLinear Time Maximum Induced Matching Algorithm for Trees
A matching in a graph G is a collection of non-intersecting edges. The matching is induced if no two edges in the matching are joined by an edge in G. This paper studies the complexity of nding a largest induced matching when the input graph is a tree. We describe the rst linear time algorithm for this problem.
متن کاملMaximum Cardinality Matching
A matching in a graph G is a subset M of the edges of G such that no two share an endpoint. A matching has maximum cardinality if its cardinality is at least as large as that of any other matching. An odd-set cover OSC of a graph G is a labeling of the nodes of G with integers such that every edge of G is either incident to a node labeled 1 or connects two nodes labeled with the same number i ≥...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2018
ISSN: 0895-4801,1095-7146
DOI: 10.1137/17m1120920